Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
نویسندگان
چکیده
Fault-tolerant hamiltonicity and faulttolerant hamiltonian connectivity of the folded Petersen cube networks Cheng-Kuan Lin a , Tung-Yang Ho b , Jimmy J.M. Tan a & Lih-Hsing Hsu c a Department of Computer Science , National Chiao Tung University , Hsinchu, Taiwan, Republic of China b Department of Industrial Engineering and Management , Ta Hwa Institute of Technology , Hsinchu, Taiwan, Republic of China c Department of Computer Science and Information Engineering , Providence University , Taichung, Taiwan, Republic of China Published online: 07 Nov 2008.
منابع مشابه
Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
Many papers on the fully connected cubic networks have been published for the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity and fault-tolerant hamiltonicity of the fully connected cubic network. We use FCCNn to denote the fully connected cubic network of level n. Let G = (V, E) be a graph. The fault-tolerant hamiltonian...
متن کاملFault Hamiltonicity of the Shuffle - Cubes ∗
Hypercubes are famous interconnection networks. The shuffle cubes are proposed as its variation with lower diameter. In this paper, we concentrate on the fault tolerant hamiltonicity and hamiltonian connectivity of the shuffle cube. We say that a graph G is f-hamiltonian if there is a hamiltonian cycle in G − F and is f-hamiltonian connected if there is a hamiltonian path between any two vertic...
متن کاملFault-tolerant Hamiltonicity of Dual-cube Extensive Networks
The hypercube family Qn is one of the most well-known interconnection networks in parallel computers. Using Qn, Li et al. introduced dualcube networks DC(n) and proved the vertex symmetry and some fault-tolerant hamiltonian properties of DC(n). Based on the structure of DC(n), Chen and Kao further introduced Dualcube Extensive Networks, denoted by DCEN(G). DCEN(G) is a wider family that contain...
متن کاملFault-Tolerant Hamiltonicity of Twisted Cubes
The twisted cube TQn, is derived by changing some connection of hypercube Qn according to specific rules. Recently, many topological properties of this variation cube are studied. In this paper, we consider a faulty twisted n-cube with both edge and/or node faults. Let F be a subset of V(TQn) 5 E(TQn), we prove that TQn −F remains hamiltonian if |F| [ n−2. Moreover, we prove that there exists a...
متن کاملFault-tolerant hamiltonian connectedness of cycle composition networks
It is important for a network to tolerate as many faults as possible. With the graph representation of an interconnection network, a k-regular hamiltonian and hamiltonian connected network is super fault-tolerant hamiltonian if it remains hamiltonian after removing up to k 2 vertices and/or edges and remains hamiltonian connected after removing up to k 3 vertices and/or edges. Super fault-toler...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Math.
دوره 86 شماره
صفحات -
تاریخ انتشار 2009